AN EFFICIENT MONTE-CARLO ALGORITHM FOR DUST-SCATTERING STUDY
نویسندگان
چکیده
منابع مشابه
An Efficient Sequential Monte Carlo Algorithm for Coalescent Clustering
We propose an efficient sequential Monte Carlo inference scheme for the recently proposed coalescent clustering model [1]. Our algorithm has a quadratic runtime while those in [1] is cubic. In experiments, we were surprised to find that in addition to being more efficient, it is also a better sequential Monte Carlo sampler than the best in [1], when measured in terms of variance of estimated li...
متن کاملEfficient Monte Carlo methods for light transport in scattering media
of the Dissertation . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . xvii
متن کاملAn Optimal Algorithm for Monte Carlo Estimation
A typical approach to estimate an unknown quantity is to design an experiment that produces a random variable Z distributed in 0; 1] with EZ] = , run this experiment independently a number of times and use the average of the outcomes as the estimate. In this paper, we consider the case when no a priori information about Z is known except that is distributed in 0; 1]. We describe an approximatio...
متن کاملMonte Carlo Subsurface Scattering
Subsurface scattering is a technique that has been of great interest to me for some time now. As a 3D lighting artist, the technique has played a huge part in the quality of my renders. My goal with this project was to gain a deeper understanding of the technique so that I may use it in a more intelligent and efficient manner within my art. Figure 1: Example of subsurface scattered light; left ...
متن کاملEfficient Monte Carlo algorithm and high-precision results for percolation.
We present a new Monte Carlo algorithm for studying site or bond percolation on any lattice. The algorithm allows us to calculate quantities such as the cluster size distribution or spanning probability over the entire range of site or bond occupation probabilities from zero to one in a single run which takes an amount of time scaling linearly with the number of sites on the lattice. We use our...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Publications of The Korean Astronomical Society
سال: 2010
ISSN: 1225-1534
DOI: 10.5303/pkas.2010.25.4.177